Fire Containment in Planar Graphs
نویسندگان
چکیده
منابع مشابه
Containment relations in split graphs
A graph containment problem is to decide whether one graph can be modified into some other graph by using a number of specified graph operations. We consider edge deletions, edge contractions, vertex deletions and vertex dissolutions as possible graph operations permitted. By allowing any combination of these four operations we capture the following ten problems: testing on (induced) minors, (i...
متن کاملmax-cut and Containment Relations in Graphs
We study max-cut in classes of graphs defined by forbidding a single graph as a subgraph, induced subgraph, or minor. For the first two containment relations, we prove dichotomy theorems. For the minor order, we show how to solve max-cut in polynomial time for the class obtained by forbidding a graph with crossing number at most one (this generalizes a known result for K5-minor-free graphs) and...
متن کاملPlanar graph is on fire
Let G be any connected graph on n vertices, n ≥ 2. Let k be any positive integer. Suppose that a fire breaks out on some vertex of G. Then in each turn k firefighters can protect vertices of G — each can protect one vertex not yet on fire; Next a fire spreads to all unprotected neighbours. The k-surviving rate of G, denoted by ρ k (G), is the expected fraction of vertices that can be saved from...
متن کاملBroadcasting in planar graphs
For an arbitrary graph on n vertices, the minimum time required to broadcast is pogz n 1, and for any n, there exist graphs on n vertices with broadcast time equal to fIogz n 1. When restricted to planar graphs, this is generally not the case; however, just one additional time unit is sufficient to allow broadcasting in certain planar graphs. We also show that the maximum number of vertices in ...
متن کاملFire containment in grids of dimension three and higher
We consider a deterministic discrete-time model of fire spread introduced by Hartnell [1995] and the problem of minimizing the number of burnt vertices when deploying a limited number of firefighters per timestep. While only two firefighters per timestep are needed in the two dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [2002] that 2d − 1 firefighters p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2012
ISSN: 0364-9024
DOI: 10.1002/jgt.21673